Application Of Rectangular Matrices: Affine Cipher Using Asymmetric Keys

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Self Generating Multi Keys Cryptosystem Model for Non-Invertible Matrices based on Hill Cipher

Many cryptosystems were designed to prevent data from unauthorized access, and some are relatively secure but slow. Others are fast but relatively not secure enough. One of the most efficient cryptosystems is Hill Cipher algorithm which is classified as symmetric encryption. In this paper we provide a solution for the problem of non-invertible matrix by modifying the way of dealing with key mat...

متن کامل

Sparsiication of Rectangular Matrices

Given a rectangular matrix with more columns than rows, nd a base of linear combinations of the row vectors such that these contain as many zero entries as possible. This process is called \sparsiication" (of the matrix). A combinatorial search method to solve sparsiication is presented which needs exponentially many arithmetic operations (in terms of the size of the matrix). However, various p...

متن کامل

Pseudospectra of rectangular matrices

Pseudospectra of rectangular matrices vary continuously with the matrix entries, a feature that eigenvalues of these matrices do not have. Some properties of eigenvalues and pseudospectra of rectangular matrices are explored, and an efficient algorithm for the computation of pseudospectra is proposed. Applications are given in (square) eigenvalue computation (Lanczos iteration), square pseudosp...

متن کامل

Likelihood Estimation for Block Cipher Keys

In this paper we give a general framework for the analysis of block ciphers using the statistical technique of likelihood estimation We show how various recent successful cryptanalyses of block ciphers can be regarded in this framework By analysing the SAFER block cipher in this framework we expose a cryptographic weakness of that cipher

متن کامل

Products of Random Rectangular Matrices

We study the asymptotic behaviour of points under matrix cocyles generated by rectangular matrices. In particular we prove a random Perron-Frobenius and a Multiplicative Ergodic Theorem. We also provide an example where such products of random rectangular matrices arise in the theory of random walks in random environments and where the Multiplicative Ergodic Theorem can be used to investigate r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: CAUCHY

سال: 2019

ISSN: 2477-3344,2086-0382

DOI: 10.18860/ca.v5i4.4408